An Innovative Genetic Algorithms-Based Inexact Non-Linear Programming Problem Solving Method

An Innovative Genetic Algorithms-Based Inexact Non-Linear Programming Problem Solving Method

In this paper, an innovative Genetic Algorithms (GA)-based inexact non-linear programming (GAINLP) problem solving approach has been proposed for solving non-linear programming optimization problems with inexact information (inexact non-linear operation programming). GAINLP was developed based on a GA-based inexact quadratic solving method. The Genetic Algorithm Solver of the Global Optimizatio...

Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms∗

The paper studies and designs an genetic algorithm (GA) of the bilevel linear programming problem (BLPP) by constructing the fitness function of the upper-level programming problem based on the definition of the feasible degree. This GA avoids the use of penalty function to deal with the constraints, by changing the randomly generated initial population into an initial population satisfying the...

Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem

The bilevel programming problems are useful tools for solving the hierarchy decision problems. In this paper, a genetic algorithm based on the simplexmethod is constructed to solve the linear-quadratic bilevel programming problem (LQBP). By use of Kuhn–Tucker conditions of the lower level programming, the LQBP is transformed into a single level programming which can be simplified to a linear pr...

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...